AbstractThe paper contains some basic results from “dart calculus” of induced subsets. We obtain as their consequence a negative answer to Hajnal's hypothesis: (m, +1∑i=0n−1(mi))→(m−1, 1+∑i−0n−1(m−1i))
AbstractA set X of subsets of an n-element set S is called an anti-chain if no two elements of X are...
Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, an...
AbstractWe improve the lower and upper bounds reported by Herzog and Schönheim for mr(p), the minimu...
AbstractThe paper contains some basic results from “dart calculus” of induced subsets. We obtain as ...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractFollowing a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractA family T of k-subsets of an n-set such that no more than r have pairwise fewer than s elem...
AbstractLet X1, …, Xn be n disjoint sets. For 1 ⩽ i ⩽ n and 1 ⩽ j ⩽ h let Aij and Bij be subsets of ...
AbstractFor a class C of subsets of a set X, let V(C) be the smallest n such that no n-element set F...
AbstractRecently I proved the following theorem: To every positive integer m there exists a positive...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
The inducibility of a graph H measures the maximum number of induced copies of H a large graph G can...
AbstractA set X of subsets of an n-element set S is called an anti-chain if no two elements of X are...
Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, an...
AbstractWe improve the lower and upper bounds reported by Herzog and Schönheim for mr(p), the minimu...
AbstractThe paper contains some basic results from “dart calculus” of induced subsets. We obtain as ...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractFollowing a conjecture of P. Erdös, we show that if F is a family of k-subsets of and n-set ...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractA family T of k-subsets of an n-set such that no more than r have pairwise fewer than s elem...
AbstractLet X1, …, Xn be n disjoint sets. For 1 ⩽ i ⩽ n and 1 ⩽ j ⩽ h let Aij and Bij be subsets of ...
AbstractFor a class C of subsets of a set X, let V(C) be the smallest n such that no n-element set F...
AbstractRecently I proved the following theorem: To every positive integer m there exists a positive...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
The inducibility of a graph H measures the maximum number of induced copies of H a large graph G can...
AbstractA set X of subsets of an n-element set S is called an anti-chain if no two elements of X are...
Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, an...
AbstractWe improve the lower and upper bounds reported by Herzog and Schönheim for mr(p), the minimu...
DOI
Add to ORKG